全文获取类型
收费全文 | 4181篇 |
免费 | 366篇 |
国内免费 | 200篇 |
专业分类
化学 | 636篇 |
晶体学 | 5篇 |
力学 | 281篇 |
综合类 | 64篇 |
数学 | 3154篇 |
物理学 | 607篇 |
出版年
2023年 | 47篇 |
2022年 | 63篇 |
2021年 | 96篇 |
2020年 | 117篇 |
2019年 | 88篇 |
2018年 | 88篇 |
2017年 | 101篇 |
2016年 | 129篇 |
2015年 | 100篇 |
2014年 | 157篇 |
2013年 | 258篇 |
2012年 | 172篇 |
2011年 | 181篇 |
2010年 | 181篇 |
2009年 | 233篇 |
2008年 | 281篇 |
2007年 | 308篇 |
2006年 | 238篇 |
2005年 | 215篇 |
2004年 | 182篇 |
2003年 | 157篇 |
2002年 | 175篇 |
2001年 | 124篇 |
2000年 | 135篇 |
1999年 | 117篇 |
1998年 | 113篇 |
1997年 | 93篇 |
1996年 | 81篇 |
1995年 | 57篇 |
1994年 | 56篇 |
1993年 | 60篇 |
1992年 | 36篇 |
1991年 | 33篇 |
1990年 | 24篇 |
1989年 | 27篇 |
1988年 | 35篇 |
1987年 | 23篇 |
1986年 | 26篇 |
1985年 | 20篇 |
1984年 | 29篇 |
1983年 | 5篇 |
1982年 | 17篇 |
1981年 | 10篇 |
1980年 | 11篇 |
1979年 | 8篇 |
1978年 | 11篇 |
1977年 | 10篇 |
1976年 | 7篇 |
1975年 | 3篇 |
1974年 | 3篇 |
排序方式: 共有4747条查询结果,搜索用时 953 毫秒
11.
On the Application of the Auxiliary Problem Principle 总被引:6,自引:0,他引:6
The auxiliary problem principle (APP) derives from a general theory on decomposition-coordination methods establishing a comprehensive framework for both one-level and two-level methods. In this paper, the results of the two-level methods of APP are specialized for an efficient application to some engineering problems. 相似文献
12.
线性规划联合算法的理论与应用 总被引:6,自引:4,他引:2
本在[1]的基础上.较系统的叙述了线性规划联合算法的步骤、相关理论及其应用,指出该算法具有避免人工变量、减少迭代次数、使用灵活、应用方便等特点。 相似文献
13.
14.
The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large. 相似文献
15.
A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
16.
We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants. 相似文献
17.
We deal with MAXH0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ0+1)/(B+2+ν0), where B=maxv∈VdG(v), δ0=minv∈V(H0)dH0(v) and ν0=(|V(H0)|+1)/δ0. Next, we show that this ratio rises up to 3/(B+1) when H0=K3. Finally, we provide hardness results for MAXK3-FREE PARTIAL SUBGRAPH. 相似文献
18.
A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem. 相似文献
19.
Asaf Levin 《Operations Research Letters》2004,32(6):530-534
Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm. 相似文献
20.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献